class Solution {
public:
    int minPathSum(vector<vector<int>>& gr) {
        int m=gr.size();
        int n=gr[0].size();
        vector<vector<int>> dp(m+1,vector<int>(n+1,INT_MAX));
        dp[0][1]=1;
        dp[1][0]=0;
        for(int i=1;i<m+1;++i)
        {
            for(int j=1;j<n+1;++j)
            {
                dp[i][j]=min(dp[i-1][j],dp[i][j-1])+gr[i-1][j-1];
            }
        }
        return dp[m][n];
    }
};
